Algebraic Cryptanalysis of 58-Round SHA-1
نویسندگان
چکیده
In 2004, a new attack against SHA-1 has been proposed by a team leaded by Wang [15]. The aim of this article is to sophisticate and improve Wang’s attack by using algebraic techniques. We introduce new notions, namely semi-neutral bit and adjuster and propose then an improved message modification technique based on algebraic techniques. In the case of the 58-round SHA-1, the experimental complexity of our improved attack is 2 SHA-1 computations, whereas Wang’s method needs 2 SHA-1 computations. We have found many new collisions for the 58-round SHA-1. We also study the complexity of our attack for the
منابع مشابه
Gröbner Basis Based Cryptanalysis of SHA-1
Recently, Wang proposed a new method to cryptanalyze SHA-1 and found collisions of 58-round SHA-1. However many details of Wang’s attack are still unpublished, especially, 1) How to find differential paths? 2) How to modify messages properly? For the first issue, some results have already been reported. In our article, we clarify the second issue and give a sophisticated method based on Gröbner...
متن کاملCube Attacks and Cube-Attack-Like Cryptanalysis on the Round-Reduced Keccak Sponge Function
In this paper, we comprehensively study the resistance of keyed variants of SHA-3 (Keccak) against algebraic attacks. This analysis covers a wide range of key recovery, MAC forgery and other types of attacks, breaking up to 9 rounds (out of the full 24) of the Keccak internal permutation much faster than exhaustive search. Moreover, some of our attacks on the 6-round Keccak are completely pract...
متن کاملLogical Reasoning to Detect Weaknesses About SHA-1 and MD4/5
In recent years, studies about the SATisfiability Problem (short for SAT) were more and more numerous because of its conceptual simplicity and ability to express a large set of various problems. Within a practical framework, works highlighting SAT implications in real world problems had grown significantly. In this way, a new field called logical cryptanalysis appears in the 2000s and consists ...
متن کاملOn Blue Midnight Wish Decomposition
Blue Midnight Wish is one of the 14 candidates in the second round of the NIST SHA-3 competition [1]. In this paper we present a decomposition of the Blue Midnight Wish core functions, what gives deeper look at the Blue Midnight Wish family of hash functions and a tool for their cryptanalysis. We used this decomposition for better understanding the insights of Blue Midnight Wish functions and t...
متن کاملRotational Cryptanalysis of Round-Reduced Keccak
In this paper we attack round-reduced Keccak hash function with a technique called rotational cryptanalysis. We focus on Keccak variants proposed as SHA-3 candidates in the NIST’s contest for a new standard of cryptographic hash function. Our main result is a preimage attack on 4-round Keccak and a 5-round distinguisher on Keccak-f [1600] permutation — the main building block of Keccak hash fun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007